Voronoi diagrams in Cgal
نویسنده
چکیده
In this paper we describe a generic C++ adaptor, that adapts a 2-dimensional triangulated Delaunay graph and to the corresponding a Voronoi diagram, represented as a doubly connected edge list (DCEL) data structure. Our adaptor has the ability to automatically eliminate, in a consistent manner, degenerate features of the Voronoi diagram, that are artifacts of the requirement that Delaunay graphs should be triangulated even in degenerate configurations. Depending on the type of operations that the underlying Delaunay graph supports, our adaptor allows for the incremental or dynamic construction of Voronoi diagrams and can support point location queries. Our code will appear in the next public release of Cgal.
منابع مشابه
Exact Implementation of Arrangements of Geodesic Arcs on the Sphere with Applications
Recently, the Arrangement 2 package of Cgal, the Computational Geometry Algorithms Library, has been greatly extended to support arrangements of curves embedded on two-dimensional parametric surfaces. The general framework for sweeping a set of curves embedded on a two-dimensional parametric surface was introduced in [3]. In this paper we concentrate on the specific algorithms and implementatio...
متن کاملAlgorithms for Complex Shapes with Certified Numerics and Topology Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
We present a general framework for computing two-dimensional Voronoi diagrams of different site classes under various distance functions. The computation of the diagrams employs the cgal software for constructing envelopes of surfaces in 3-space, which implements a divide-and-conquer algorithm. A straightforward application of the divide-and-conquer approach for Voronoi diagrams yields highly i...
متن کاملAlgorithms for Complex Shapes with Certified Numerics and Topology Arrangements of Geodesic Arcs on the Sphere
In this report we concentrate on exact construction and maintenance of arrangements induced by arcs of great circles embedded on the sphere, also known as geodesic arcs, and exact computation of Voronoi diagrams on the sphere, the bisectors of which are geodesic arcs. This class of Voronoi diagrams includes the subclass of Voronoi diagrams of points and its generalization, power diagrams, also ...
متن کاملExact Construction of Minimum-Width Annulus of Disks in the Plane
The construction of a minimum-width annulus of a set of objects in the plane has useful applications in diverse fields, such as tolerancing metrology and facility location. We present a novel implementation of an algorithm for obtaining a minimum-width annulus containing a given set of disks in the plane, in case one exists. The algorithm extends previously known methods for constructing minimu...
متن کاملConvex Hull and Voronoi Diagram of Additively Weighted Points
We provide a complete description of dynamic algorithms for constructing convex hulls and Voronoi diagrams of additively weighted points of R. We present simple algorithms and provide a complete description of all the predicates. The algorithms have been implemented in R and experimental results are reported. Our implementation follows the CGAL design and, in particular, is made both robust and...
متن کامل